Papers with dynamic programming algorithm
Headed-Span-Based Projective Dependency Parsing (2022.acl-long)
Copied to clipboard
| Challenge: | Existing methods for dependency parsing based on headed spans are available. |
| Approach: | They propose a method for projective dependency parsing based on headed spans. |
| Outcome: | The proposed method achieves state-of-the-art or competitive results on PTB, CTB, and UD Dependency parsing is an important task in natural language processing. |
Recursive Top-Down Production for Sentence Generation with Latent Trees (2020.findings-emnlp)
Copied to clipboard
| Challenge: | Various studies have shown that incorporating syntactic structures into recursive encoders can be beneficial for various natural language tasks. |
| Approach: | They propose a dynamic programming algorithm that marginalises over latent binary tree structures with N leaves to train a recursive neural function. |
| Outcome: | The proposed model outperforms previous models on the LENGTH split and English question formation tasks on the Multi30k dataset. |
A Framework for Bidirectional Decoding: Case Study in Morphological Inflection (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Existing encoder-decoders that generate sequences from left to right are prone to errors due to the "snowballing" effect. |
| Approach: | They propose a transformer-based encoder-decoder framework that produces sequences from the "outside-in" they argue that this approach is more principled than prior bidirectional decoders . |
| Outcome: | The proposed model beats the current system by over 4.7 and 2.7 points in accuracy on 2022 and 2023 tasks. |
CLaSp: In-Context Layer Skip for Self-Speculative Decoding (2025.acl-long)
Copied to clipboard
Longze Chen, Renke Shan, Huiming Wang, Lu Wang, Ziqiang Liu, Run Luo, Jiawei Wang, Hamid Alinejad-Rokny, Min Yang
| Challenge: | Existing methods for drafting Large Language Models require additional modules to be trained, which can be challenging to implement and ensure compatibility across various LLMs. |
| Approach: | They propose an in-context layer-skipping strategy for self-speculative decoding that uses a plug-and-play mechanism to skip intermediate layers of the verify model to construct a compressed draft model. |
| Outcome: | The proposed method achieves a speedup of 1.3 1.7 on LLaMA3 series models without altering the original distribution of the generated text. |